A Piecewise Line-Search Technique for Maintaining the Positive Definitenes of the Matrices in the SQP Method

نویسندگان

  • Paul Armand
  • Jean Charles Gilbert
چکیده

A technique for maintaining the positive definiteness of the matrices in the quasi-Newton version of the SQP algorithm is proposed. In our algorithm, matrices approximating the Hessian of the augmented Lagrangian are updated. The positive definiteness of these matrices in the space tangent to the constraint manifold is ensured by a so-called piecewise line-search technique, while their positive definiteness in a complementary subspace is obtained by setting the augmentation parameter. In our experiment, the combination of these two ideas leads to a new algorithm that turns out to be more robust and often improves the results obtained with other approaches.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Piecewise Line-Search Technique for Maintaining the Positive Definiteness of the Matrices in the SQP Method

A technique for maintaining the positive definiteness of the matrices in the quasi-Newton version of the SQP algorithm is proposed. In our algorithm, matrices approximating the Hessian of the augmented Lagrangian are updated. The positive definiteness of these matrices in the space tangent to the constraint manifold is ensured by a so-called piecewise line-search technique, while their positive...

متن کامل

Piecewise line-search techniques for constrained minimization by quasi-Newton algorithms

Defining a consistent technique for maintaining the positive definiteness of the matrices generated by quasi-Newton methods for equality constrained minimization remains a difficult open problem. In this paper, we review and discuss the results obtained with a new technique based on an extension of the Wolfe line-search used in unconstrained optimization. The idea is to follow a piecewise linea...

متن کامل

A Free Line Search Steepest Descent Method for Solving Unconstrained Optimization Problems

In this paper, we solve unconstrained optimization problem using a free line search steepest descent method. First, we propose a double parameter scaled quasi Newton formula for calculating an approximation of the Hessian matrix. The approximation obtained from this formula is a positive definite matrix that is satisfied in the standard secant relation. We also show that the largest eigen value...

متن کامل

Enlarging Domain of Attraction for a Special Class of Continuous-time Quadratic Lyapunov Function Piecewise Affine Systems based on Discontinuous Piecewise

This paper presents a new approach to estimate and to enlarge the domain of attraction for a planar continuous-time piecewise affine system. Various continuous Lyapunov functions have been proposed to estimate and to enlarge the system’s domain of attraction. In the proposed method with a new vision and with the aids of a discontinuous piecewise quadratic Lyapunov function, the domain of attrac...

متن کامل

A new algorithm for solving Van der Pol equation based on piecewise spectral Adomian decomposition ‎method‎

‎‎In this article‎, ‎a new method is introduced to give approximate solution to Van der Pol equation‎. ‎The proposed method is based on the combination of two different methods‎, ‎the spectral Adomian decomposition method (SADM) and piecewise method‎, ‎called the piecewise Adomian decomposition method (PSADM)‎. ‎The numerical results obtained from the proposed method show that this method is an...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Comp. Opt. and Appl.

دوره 16  شماره 

صفحات  -

تاریخ انتشار 2000